Parallel intersection and serial composition of finite state transducers
نویسندگان
چکیده
We describe a linguistically expressive and easy to implement parallel semantics for quasi-deterministic finite state transducers (FSTS) used as acceptors. Algorithms are given for detemain-ing acceptance of pairs of phoneme strings given a parallel suite of such transducers and for constructing the equivalent single transducer by parallel intersection. An algorithm for constructing the serial composition of a sequence of such transducers is also given. This algorithm can produce generally non-detemlinislic FSTS and an algorithm is presented for eliminating the unacceptable nondeterminism. Finally, the work is discussed in the context of other work on finite state transducers.
منابع مشابه
The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata
This paper uses parameterized complexity analysis to delimit possible non-polynomial time algorithmic behaviors for the finite-state acceptor intersection and finite-state transducer intersection and composition problems. One important result derived as part of these analyses is the first proof of the NP -hardness of the finite-state transducer composition problem for both general and p-subsequ...
متن کاملFSA Utilities: A Toolbox to Manipulate Finite-State Automata
This paper describes the FSA Utilities toolbox: a collection of utilities to manipulate nite-state automata and nite-state transducers. Manipulations include determinization (both for nite-state accep-tors and nite-state transducers), minimization, composition, comple-mentation, intersection, Kleene closure, etc. Furthermore, various visu-alization tools are available to browse nite-state autom...
متن کاملSpeeding up the Stress Analysis of Hollow Circular FGM Cylinders by Parallel Finite Element Method
In this article, a parallel computer program is implemented, based on Finite Element Method, to speed up the analysis of hollow circular cylinders, made from Functionally Graded Materials (FGMs). FGMs are inhomogeneous materials, which their composition gradually varies over volume. In parallel processing, an algorithm is first divided to independent tasks, which may use individual or shared da...
متن کاملMulti-threaded composition of finite-state-automata
We investigate the composition of finitestate automata in a multiprocessor environment, presenting a parallel variant of a widely-used composition algorithm. We provide an approximate upper bound for composition speedup of the parallel variant with respect to serial execution, and empirically evaluate the performance of our implementation with respect to this bound.
متن کاملGeneral Algorithms for Testing the Ambiguity of Finite Automata and the Double-Tape Ambiguity of Finite-State Transducers
We present efficient algorithms for testing the finite, polynomial, and exponential ambiguity of finite automata with ǫ-transitions. We give an algorithm for testing the exponential ambiguity of an automaton A in time O(|A| E ), and finite or polynomial ambiguity in time O(|A| E ), where |A|E denotes the number of transitions of A. These complexities significantly improve over the previous best...
متن کامل